Distance-regular graphs, MH-colourings and MLD-colourings
نویسندگان
چکیده
منابع مشابه
Distance-regular graphs, MH-colourings and MLD-colourings
It is shown that the only bipartite distance regular graphs of diameter 3 which are MLDcolourable are the incidence graphs of complementary Hadamard designs.
متن کاملSampling 3-colourings of regular bipartite graphs
We show that if Σ = (V,E) is a regular bipartite graph for which the expansion of subsets of a single parity of V is reasonably good and which satisfies a certain local condition (that the union of the neighbourhoods of adjacent vertices does not contain too many pairwise nonadjacent vertices), and if M is a Markov chain on the set of proper 3-colourings of Σ which updates the colour of at most...
متن کاملBalanced colourings of strongly regular graphs
A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices of the graph. Such a colouring is balanced if every pair of distinct colours occurs equally often on the ends of an edge. When the graph is the complete regular multipartite graph a balanced colouring is just a balanced incomplete-block design, or 2-design. Some constructions are given. For examp...
متن کاملInterval Colourings of Some Regular Graphs
Let G = (V,E) be an undirected graph without loops and multiple edges [1], V (G) and E(G) be the sets of vertices and edges of G, respectively. The degree of a vertex x ∈ V (G) is denoted by dG(x), the maximum degree of a vertex of G-by ∆(G), and the chromatic index [2] of G-by χ(G). A graph is regular, if all its vertices have the same degree. If α is a proper edge colouring of the graph G [3]...
متن کاملList Colourings of Regular Hypergraphs
We show that the list chromatic number of a simple d-regular r-uniform hypergraph is at least (1/2r log(2r 2) + o(1)) log d if d is large.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00326-3